A characterization of pseudoinvexity in multiobjective programming

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A characterization of pseudoinvexity in multiobjective programming

In this paper, we introduce new classes of vector functions which generalize the class of scalar invex functions. We prove that these new classes of vector functions are characterized in such a way that every vector critical point is an efficient solution of a Multiobjective Programming Problem. We establish relationships between these new classes of functions and others used in the study of ef...

متن کامل

Duality for Multiobjective Variational Control and Multiobjective Fractional Variational Control Problems with Pseudoinvexity

The relationship between mathematical programming and classical calculus of variation was explored and extended by Hanson [6]. Thereafter variational programming problems have attracted some attention in literature. Duality for multiobjective variational problems has been of much interest in the recent years, and several contributions have been made to its development (see, e.g., Bector and Hus...

متن کامل

Characterization of Properly Efficient Solutions for Convex Multiobjective Programming with Nondifferentiable vanishing constraints

This paper studies the convex multiobjective optimization problem with vanishing constraints‎. ‎We introduce a new constraint qualification for these problems‎, ‎and then a necessary optimality condition for properly efficient solutions is presented‎. ‎Finally by imposing some assumptions‎, ‎we show that our necessary condition is also sufficient for proper efficiency‎. ‎Our results are formula...

متن کامل

Solving multiobjective linear programming problems using ball center of polytopes

Here‎, ‎we aim to develop a new algorithm for solving a multiobjective linear programming problem‎. ‎The algorithm is to obtain a solution which approximately meets the decision maker's preferences‎. ‎It is proved that the proposed algorithm always converges to a weak efficient solution and at times converges to an efficient solution‎. ‎Numerical examples and a simulation study are used to illu...

متن کامل

tragic contradictions: a comparative study of characterization in eugene o’neill’s long day’s journey into night and mahmud dowlatabadi’s tangna

در طی چند دهه ی اخیر، مفهوم «تراژدی» و «قهرمان تراژدی» توجهی روزافرون را تقریباً در تمام حوزه های نقد ادبی به خود معطوف کرده است. برخی نظیر ارسطو، نیچه، و آرتور میلر به بازخوانی آن پرداخته و برخی دیگر نظیر سارتر، استریندبرگ، یوجین اُنیل، برتولت برشت، و آنتونین آرتود به افزودن ابعاد نوینی به این مبحث همت گماشته اند. آنچه قهرمان تراژدی مدرن را از مفهوم کلاسیک آن متمایز می کند نه لغزش تراژیک متداول ...

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical and Computer Modelling

سال: 2008

ISSN: 0895-7177

DOI: 10.1016/j.mcm.2008.05.054